Randomization Yields Simple O ( n log ⋆ n ) Algorithms for Difficult Ω ( n ) Problemss
نویسنده
چکیده
We use here the results on the influence graph[1] to adapt them for particular cases where additional information is available. In some cases, it is possible to improve the expected randomized complexity of algorithms from O(n log n) to O(n log n). This technique applies in the following applications : triangulation of a simple polygon, skeleton of a simple polygon, Delaunay triangulation of points knowing the EMST (euclidean minimum spanning tree).
منابع مشابه
RANDOMIZATION YIELDS SIMPLE O(n log n) ALGORITHMS FOR DIFFICULT (n) PROBLEMS
We use here the results on the in uence graph[1] to adapt them for particular cases where additional information is available. In some cases, it is possible to improve the expected randomized complexity of algorithms from O(n log n) to O(n log? n). This technique applies in the following applications : triangulation of a simple polygon, skeleton of a simple polygon, Delaunay triangulation of po...
متن کاملRandomization yields simple O(n log star n) algorithms for difficult Omega(n) problems
We use here the results on the influence graph[1] to adapt them for particular cases where additional information is available. In some cases, it is possible to improve the expected randomized complexity of algorithms from O(n log n) to O(n log n). This technique applies in the following applications : triangulation of a simple polygon, skeleton of a simple polygon, Delaunay triangulation of po...
متن کاملOptimizing Integer Sorting in O(n log log n) Expected Time in Linear Space
The traditional algorithms for integer sorting give a bound of O(n log n) expected time without randomization and O(n) with randomization. Recent researches have optimized lower bound for deterministic algorithms for integer sorting [4, 5, 7]. We present a fast deterministic algorithm for integer sorting in linear space. The algorithm discussed in this paper sorts n integers in the range {0, 1,...
متن کاملOn-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number of vertices). This algorithm is optimal – there is no on-line deterministic algorithm that achieves a competitive ratio better than (2n − 1) in all metric spaces. We also study the stable marriage problem, where we are in...
متن کاملRandomization Can Be as Helpful as a Glimpse of the Future in Online Computation
We provide simple but surprisingly useful direct product theorems for proving lower bounds on online algorithms with a limited amount of advice about the future. Intuitively, our direct product theorems say that if b bits of advice are needed to ensure a cost of at most t for some problem, then r · b bits of advice are needed to ensure a total cost of at most r · t when solving r independent in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992